#include <bits/stdc++.h>
using namespace std;
int r[1000001];

struct node{
    int idx,v;
    bool operater >(node a,node b){
        return a.v>b.v;
    }
}p;

priority_queue<node> pq;
priority_queue<int>dfind;
int main()
{
    freopen("color.in","r",stdin);
    freopen("color.out","w",stdout);
    int T;cin>>T;
    for(int i=0;i<T;i++)
    {
        memset(r,0,sizeof(r));
        int n,tmp;cin>>n;
        int cnt=0;
        for(int x=0;x<n;x++){
            cin>>tmp;
            r[tmp]++;
            node a;a.idx=x;a.v=tmp;
            pq.push(a);
            if(r[tmp]>1){
                cnt++;
                dfind.push(cmp);
            }
        }


    }
    return 0;
}
